Sweep-Line Unfolding of the Rea hability Graph
نویسنده
چکیده
منابع مشابه
Ôôóöøøóòòòò Ì Blockinòòõùù Óö Ae Blockin Blockin Blockinòø Êêê Blockinððøý Òòðý××× Óó Óò Blockinùöööòø Çç Blockinø¹çöööòøøø Èöóóööñ×
Con urrent Obje t-Oriented Programs Sridhar Iyer. S. Ramesh. Dept. of Computer S ien e Dept of Computer S ien e IIT Guwahati IIT Bombay Guwahati, INDIA Mumbai, INDIA email : sri iitg.ernet.in ramesh se.iitb.ernet.in Abstra t The obje t-oriented paradigm has been found to be useful for the onstru tion of large and omplex onurrent systems. Rea hability analysis is an important and well-known tool...
متن کاملËøöù Blockinøùöð Öö Blockinøöþþøóò Ò Õùùðøøú Ôöóôöø× Ó Èöóù Blockinø Óöñ Ëøó Blockin×ø Èøöö Aeaeø×
1 LAMSADE, Université Paris Dauphine, {haddad,moreaux} lamsade.dauphine.fr, 2 LERI-RESYCOM, Université de Reims Champagne-Ardenne, 3 Dipartimento di Informati a, Università di Torino, matteo di.unito.it, 4 Dep. de Ingenieria Ele .a e Informati a, Universidad de Zaragoza, silva posta.unizar.es Abstra t. The model of Sto hasti Petri nets (SPN) with a produ t form solution (Π-net) is a lass of net...
متن کاملOn Flatness for 2-Dimensional Vector Addition Systems with States
1 DIRO, Université de Montréal, Montréal, QC, Canada leroujer iro.umontreal. a 2 LaBRI, Univ. de Bordeaux & CNRS UMR 5800, Talen e, Fran e sutre labri.fr Abstra t. Ve tor addition systems with states (VASS) are ounter automata where (1) ounters hold nonnegative integer values, and (2) the allowed operations on ounters are in rement and de rement. A elerated symboli model he kers, like FAST, LAS...
متن کاملImproving stati ordering of BDDs for rea hability analysis
Jorgiano Vidal David D eharbe DIMAp/UFRN, Natal, RN, Brazil Dominique Borrione TIMA, Grenoble, Fran e Abstra t Binary de ision diagrams (BDDs) are used for automati synthesis and formal veri ation of ombinational and sequential ir uits. However, a larger adoption of these te hnologies for sequential designs still depends on a more eÆ ient use of BDDs. One important fa tor is the order of the va...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002